<HTML> <BODY> <h1>Graph Distance  Report </h1> <hr><br><h2> Parameters: </h2>Network Interpretation:  undirected<br /><br /> <h2> Results: </h2>Diameter: 2<br />Radius: 1<br />Average Path length: 1.3333333333333333<br />Number of shortest paths: 6<br /><br /><IMG SRC="Betweenness Centrality Distribution.png"></IMG><br /><br /><IMG SRC="Closeness Centrality Distribution.png"></IMG><br /><br /><IMG SRC="Eccentricity Distribution.png"></IMG><br /><br /><h2> Algorithm: </h2>Ulrik Brandes, <i>A Faster Algorithm for Betweenness Centrality</i>, in Journal of Mathematical Sociology 25(2):163-177, (2001)<br /></BODY> </HTML>